package amc;

import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import java.util.*;

/**
 * @className: HJ4
 * @Description:
 * @Author: wangyifei
 * @Date: 2024/3/18 21:25
 */
public class HJ4 {
    public static void main(String[] args) {

//    Scanner in = new Scanner(System.in);
//    // 注意 hasNext 和 hasNextLine 的区别
//        while (in.hasNextLine()) { // 注意 while 处理多个 case
//        String input = in.nextLine().replace(" ","");
//        int len = input.length();
//        int eight = len/8 ;
//        for(int i = 0 ; i < eight/8 ; i++){
//            System.out.println(input.substring(i , i + 7));
//        }
//        if(len%8 > 0){
//            System.out.println(
//                    input.substring(eight , eight + len%8 -1)
//            );
//        }
//    }
//        System.out.println("12345678".substring(0, 2));
//        System.out.println(1 << 0);
//        ArrayList<Integer> arrayList = new ArrayList();
//        System.out.println(Math.sqrt(64));
//            Scanner scanner = new Scanner(System.in);

//            long num = 180 ;
//            long k = (long) Math.sqrt(num);
//
//            for (long i = 2; i <= k; ++i) {
//                while (num % i == 0) {
//                    System.out.print(i + " ");
//                    num /= i;
//                }
//            }
//            System.out.println(num == 1 ? "": num+" ");
//        double a = 5.5D ;
//        String[] num = String.valueOf(a).split("\\.");
//        int zs = Integer.parseInt(num[0]);
//        double xs = Double.parseDouble("0."+num[1]);
//        System.out.println( xs >= 0.5D ? zs++ : zs);
//        double number = 5.5D;
//        System.out.println((int)(number + 0.5));
//        BitSet bs =new BitSet(100);
//        bs.set(0);
//        Map<Integer,Integer> tabs = new HashMap<>();
//        tabs.computeIfPresent(1, (k,v) -> v+1);
//        System.out.println(bs.get(0));
//        BitSet bs = new BitSet();
//        bs.set(1);
//        System.out.println(bs.cardinality());
//        Scanner scaner = new Scanner(System.in);
//        for (int i = 0; i < 10; i++) {
//            System.out.println(scaner.nextInt());
//            System.out.println(scaner.nextInt());
//        }
        HashMap<Integer,Integer> map = new HashMap<>();
        map.put(
                1,1
        );
        System.out.println(map.computeIfPresent(2, (k, v) -> v + 1));
    }
}
